Minimum Vertex Degree Threshold for <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"></math>tiling

<em xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Acts of Gaiety: LGBT Performance and the Politics of Pleasure by Sara Warner (review)

Re-Search: The Missing Pieces in Investigating African-American Relationship Dynamics and Implications for <small class="caps" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">hiv Risk

Rates of hiv/aids are disproportionately high among AfricanAmericans. Most prevention messaging has been focused at the individuals, while many of the drivers of hiv risk for AfricanAmericans exist systemically. In order to make signifi cant strides in hiv prevention and intervention, programs must account for the unique context of life experiences for AfricanAmericans. In this manuscript, we m...

Report of AAPM Therapy Physics Committee Task Group 74: In-air output ratio,@r@n<math display="inline" xmlns="http://www.w3.org/1998/Math/MathML" altimg="urn:x-wiley:0094-2405:media:mp7367:mp7367-math-0001" wiley:location="equation/mp7367-math-0001.png"><msub><mi>S</mi><mi mathvariant="normal">c</mi></msub></math>, for megavoltage photon beams

The concept of in-air output ratio Sc was introduced to characterize how the incident photon fluence per monitor unit or unit time for a Co-60 unit varies with collimator settings. However, there has been much confusion regarding the measurement technique to be used that has prevented the accurate and consistent determination of Sc. The main thrust of the report is to devise a theoretical and m...

A Note on Bipartite Graph Tiling

Bipartite graph tiling was studied by Zhao [7] who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of Ks,s. Let s < t be fixed positive integers. Hladký and Schacht [3] gave minimum degree conditions for a balanced bipartite graph on 2m(s + t) vertices to contain m vertex disjoint copies of Ks,t. Their results w...

Bipartite Graph Tiling

For each s ≥ 2, there exists m0 such that the following holds for all m ≥ m0: Let G be a bipartite graph with n = ms vertices in each partition set. If m is odd and minimum degree δ(G) ≥ n+3s 2 − 2, then G contains m vertex-disjoint copies of Ks,s. If m is even, the same holds under the weaker condition δ(G) ≥ n/2+ s− 1. This is sharp and much stronger than a conjecture of Wang [25] (for large n).